61 research outputs found

    CONVERGED WIRELESS TECHNOLOGY ARCHITECTURES: HYBRID NETWORKS CONSISTING OF LORA AND WI-SUN NODES

    Get PDF
    The embodiments presented herein utilize class B LoRa to avoid conflicts with Wi-SUN traffic that is on the same band. In areas covered by a LoRa edge, portions of the time slots of specific channels may be aggregated into longer time slots to adapt to LoRa spreading factors. Edge mesh nodes may use class B to pull traffic from channels of LoRa devices at the appropriate time. LoRa may be configured to operate in the appropriate channels, and any interference with Wi-SUN can be minimalized

    MAINTENANCE AND POWER SAVINGS IN LARGE MULTIPLANE DATA CENTER FABRICS

    Get PDF
    Within a Data Center (DC) environment network upgrades are often challenging and may consume significant amounts of time and network administrator resources. Additionally, DC networks tend to consume large amounts of energy and dissipate considerable amounts of heat that can be challenging to evacuate in densely populated fabrics. To address these challenges techniques are presented herein that support, possibly among other things, the construction of a network model; the use of Machine Learning (ML) to predict low and high load periods and, in low periods, determining the ratio of resources that may be taken offline; updating the equal-cost multi-path (ECMP) rules in the leaves to avoid selected planes so as to take the full plane spine and super-spine nodes offline; and upgrading one of the super-spine nodes and then one of the spine nodes to ensure that there is always a rollback path in case of a problem. If the upgrading is successful, the techniques may include proceeding to upgrade all of the super-spine nodes and all of the spine nodes

    DETERMINISTIC INFORMATION PULL AND AGGREGATION IN A DESTINATION-ORIENTED DIRECTED ACYCLIC GRAPH (DODAG) TOPOLOGY

    Get PDF
    Techniques are presented herein that support a deterministic collection method in the form of a scheduled pull mechanism, whereby a collection point may compute a schedule and then distribute the same so that all of the collecting nodes and network nodes can optimally transmit, aggregate, and relay information to the collection point. Under aspects of the presented techniques, a distributed set may be organized as a Destination-Oriented Directed Acyclic Graph (DODAG) topology to the collection point. The above-described schedule may then be generated whereby the DODAG parents emit only after all of their children (and, recursively, all of their descendants) have emitted. Under such an approach, an application-aware parent can aggregate (or factorize) the data and consume minimal bandwidth. A second schedule may be generated just for missing data, accounting only for the sources where information was lost, so that retry operations comprise smaller schedules

    ENABLING DETERMINISM IN A BEST EFFORT HOPPING SEQUENCE TIME SLOTTED CHANNEL HOPPING MESH

    Get PDF
    Techniques are described for sharing a network between flows that follow a deterministic hopping sequence (same sequence for all) and flows that follows a best effort hopping sequence (which depends on the receiver Media Access Control (MAC) address for unicast). This is accomplished by moving the best effort channel in case of a collision in a manner that can be predicted by the sender and that maintains the pseudo-randomness of the selection

    ROUTING PROTOCOL FOR LOW POWER AND LOSSY NETWORKS

    Get PDF
    The techniques presented herein provide Routing Protocol for Low power and Lossy Networks (RPL) that enhances the incorporation of RPL Unaware Leaves (RULs) into a network while also improving the flexibility of the network deployment. Specifically, the techniques presented herein create one or more proxies for RULs that can reduce the number of messages a RUL needs to receive. Thus, a RUL can wake less and preserve its battery. The one or more proxies proxy IPv6 protocol, such as DHCPv6, for the RUL and maintain the keep alive state for RUL

    OVERRIDING DETERMINISTIC FLOWS

    Get PDF
    Real aging is not desirable for Deterministic Network (DetNet) flows. Defined herein are new techniques that provide a similar service for DetNet flows. The new techniques involve: utilizing new Quality of Service (QoS) values to indicate a packet that is a normal DetNet packet versus a reclassified packet; reclassifying a DetNet packet to a higher priority to avoid discarding N contiguous packets of the flow; ensuring that a reclassified packet progresses through automatic repeat request (ARQ) methods; and declassifying a DetNet packet to a lower priority rather than discarding it using IP-in-IP encapsulation and a deadline header with a deadline that is computed on the fly based on the remaining time till the bounded time of delivery for the packet

    HETEROGENEOUS WIRELESS: DUAL LORA-NB-IOT REDUNDANT CONNECTIVITY

    Get PDF
    LoRa refers to a digital wireless data communication technology that enables very-long-range transmissions with low power consumption. Narrowband Internet-of-Things (NB-IoT) refers to a lower power standard focusing on indoor coverage. By combining LoRa and NB-IoT technologies, a low-energy device may receive the benefit of NB-IoT throughput, while consuming an amount of power similar to LoRa. The embodiments presented herein emulate a LoRa device over a NB-IoT network using a virtual gateway. Power usage of a device can be reduced by using LoRa and waking up NB-IoT on demand. A device may use LoRa as long as LoRa meets expected delivery ratio and timeliness criteria; the exact selection of which radio to use for each type of packet may be determined for each device by applying a machine learning profiler to the network at the beginning of the life of the device, with continuous learning thereafter. Heterogeneous LoRa-NB-IoT devices can also improve the reliability of a transmission by using both radios in parallel and introducing a frame replication and duplicate-elimination technique for highly critical packets. Thus, a device may be protected against network outages on either side

    DIFFERENTIATED RETRANSMISSION IN WIRELESS MESH NETWORKS

    Get PDF
    Techniques are described herein for enabling diverse retries at a lower layer based on possibilities provided by routing operations. An anycast model is used to indicate a set of next hops and forwarding interfaces that enable indicating raw constraints such as bounded latency to perform a transmission

    TEMPORAL ROUTING IN DELAY TOLERANT NETWORKS

    Get PDF
    In conventional network environments, routing implies a stable world in which the vision of a next hop is consistent with the vision a forwarding node, so that a packet can progress, for example, in a greedy fashion that reduces a remaining cost at each hop, to a destination. However, in the world of mobile delay tolerant networking (DTN), nodes can move in any direction, nodes may forward packets when they meet a peer, and may move in between such actions. Thus, the relative position of nodes can change between meeting such that it can become difficult to compute a physical path based on a position of all nodes. Techniques presented herein propose a foundational routing to the future model for mobile DTN nodes that may enable predictable rendezvous among such nodes. During operation, a router can, for example, compute a route along rendezvous points while optimizing for the total latency, energy, and chances of delivery based on the probability of the rendezvous to effectively occur

    NOVEL TECHNIQUES TO DISTINGUISH FADING FOR ADAPTIVE MODULATION IN A LOW POWER AND LOSSY NETWORK (LLN)

    Get PDF
    Techniques are described herein to distinguish fading for adaptive modulation in a Low power and Lossy Network (LLN). The techniques include splitting large frames into small fragments at the physical (PHY) or Media Access Control (MAC) level. Fragments are possibly acknowledged (e.g., using draft-ietf-6lofragment-recovery), which gives a bitwise signature of a transmission. Those signatures are appended to one another in a bit stream. In that bit stream, scattered losses mean fading whereas continuous losses for a brief time indicate a collision. In the former case, a node can increase power or decrease modulation and/or speed; however, in the latter case, it must not do so since this can aggravate the situation
    • …
    corecore